package alg20241029;

public class Text {
    public int minCostClimbingStairs(int[] cost) {
        int n = cost.length;
        //1创建dp表
        int[] dp = new int[n+1];
        //2初始化
        dp[0] = dp[1] = 0;
        //3填表
        for (int i = 2; i < dp.length; i++) {
            dp[i] = Math.min(dp[i-1] + cost[i-1], dp[i-2] + cost[i-2]);
        }
        //返回值
        return dp[n];
    }
}
